#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <set>

#define flr(x,l,r) for (int x = l; x <= r; ++ x)
#define frl(x,r,l) for (int x = r; x >= l; -- x)
#define fmp(x,t) for (int x = h[t]; ~x; x = ne[x])
#define LL long long 
#define mt memset
#define my memcpy 
#define szf sizeof
#define INF 0x3f3f3f3f
#define in(x) scanf("%d", &x)
#define out(x) printf("%d", x)
#define inll(x) scanf("%lld", &x)
#define outll(x) printf("%lld", x)
#define pn printf("\n")
#define con continue
#define bk break
#define vc vector
#define pb push_back
#define sz size
#define PII pair<int, int>
#define x first
#define y second
#define P_q priority_queue
#define ft front
#define pf push_front
#define popf pop_front
#define it insert
#define ct count

using namespace std;

const int N = 100010;

int n;
int a[N], b[N];

int main() {
    in(n);
    flr (i, 1, n) in(a[i]), b[i] = a[i] - a[i - 1];
    
    LL p = 0, q = 0;
    flr (i, 2, n)
        if (b[i] > 0) p += b[i];
        else q -= b[i];
    
    outll(max(p, q)), pn;
    outll(abs(p - q) + 1), pn;
    
    return 0;
}